Unified Forward and Inverse Transform Architecture

ABSTRACT

Multiple transform sizes improve video coding efficiency, but also increase the implementation complexity. Furthermore, both forward and inverse transforms need to be supported in various consumer devices. Embodiments provide a unified forward and inverse transform architecture that supports computation of both forward and inverse transforms for multiple transforms sizes using shared hardware circuits. The unified architecture exploits the symmetry properties of forward and inverse transform matrices to achieve hardware sharing across different the transform sizes and also between forward and inverse transform computations.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims benefit of U.S. Provisional Patent Application Ser. No. 61/555,364 filed Nov. 3, 2011, and U.S. Provisional Patent Application Ser. No. 61/559,908 filed Nov. 15, 2011, which are incorporated herein by reference in their entirety.

BACKGROUND OF THE INVENTION

1. Field of the Invention

Embodiments of the present invention generally relate to a unified forward and inverse transform architecture for video coding.

2. Description of the Related Art

The Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T WP3/16 and ISO/IEC JTC 1/SC 29/WG 11 is currently developing the next-generation video coding standard referred to as High Efficiency Video Coding (HEVC). HEVC is expected to provide around 50% reduction in bitrate (at similar visual quality) over the current standard, H.264/AVC, and intended to support larger resolutions and higher frame rates. To address these requirements, HEVC utilizes larger block sizes than H.264/AVC. In HEVC, the largest coding unit (LCU) can be up to 64×64 in size and support for transform sizes of 4×4, 8×8, 16×16, 32×32, 16×4, 4×16, 32×8, and 8×32 is proposed. Multiple transform sizes improve compression performance, but also increase implementation complexity.

Products such as camera phones, tablets, video-conferencing systems, and set-top boxes with digital video recording features typically implement both video capture and video playback. Thus, video encoding and decoding are both implemented in such products, which requires the implementation of both forward and inverse transforms in the same device. Accordingly, reduction of the overall area of the hardware block that implements forward and reverse transforms is desirable.

SUMMARY

Embodiments of the present invention relate to apparatus and methods for unified forward and inverse transform computation. In one aspect, an apparatus for computation of forward and inverse transforms is provided that includes a first decomposition circuit configured to receive an N-point input vector, wherein the first decomposition circuit is operable to decompose the N-point input vector to form a first (N/2)-point vector and a second (N/2)-point vector, wherein, in response to a control signal, the first (N/2)-point vector and the second (N/2)-point vector are inputs for an N-point forward transform computation or inputs for an N-point inverse transform computation, a first matrix multiplication circuit coupled to the first decomposition circuit to receive the second (N/2)-point vector, a forward and inverse (N/2)-point transform computation circuit coupled to the first decomposition circuit to receive the first (N/2)-point vector, a first recomposition circuit coupled to receive a first (N/2)-point output vector from the first matrix multiplication circuit and a second (N/2)-point output vector from the forward and inverse (N/2)-point transform computation circuit, wherein the first recomposition circuit is operable to compose an N-point output vector from the first (N/2)-point output vector and the second (N/2)-point output vector, wherein, in response to the control signal, the N-point output vector is an output of the N-point forward transform computation or an output of the N-point inverse transform computation, wherein the first matrix multiplication circuit is configured to multiply an (N/2)-point vector with an (N/2)×(N/2) matrix, the (N/2)×(N/2) matrix consisting of elements from odd lines of an N×N transform coefficient matrix, and wherein the forward and inverse (N/2)-point transform computation circuit is configured to compute an (N/2)-point forward transform or an (N/2)-point inverse transform responsive to the control signal.

In one aspect, a method for computation of forward and inverse N-point transforms is provided that includes receiving a control signal, wherein the control signal indicates where a forward transform or an inverse transform is to be computed, receiving an N-point input vector in a first decomposition circuit, wherein the first decomposition circuit is operable to decompose the N-point input vector to form a first (N/2)-point vector and a second (N/2)-point vector, wherein, in response to the control signal, the first (N/2)-point vector and the second (N/2)-point vector are inputs for an N-point forward transform computation or inputs for an N-point inverse transform computation, performing matrix multiplication of the second (N/2)-point vector with an (N/2)×(N/2) matrix in a first matrix multiplication circuit, the first matrix multiplication circuit coupled to the first decomposition circuit to receive the second (N/2)-point vector, wherein the (N/2)×(N/2) matrix consists of elements from odd lines of an N×N transform coefficient matrix, computing an (N/2)-point transform of the first (N/2)-point vector in a forward and inverse (N/2)-point transform computation circuit coupled to the first decomposition circuit to receive the first (N/2)-point vector, wherein the forward and inverse (N/2)-point transform computation circuit is operable to compute an (N/2)-point forward transform or an (N/2)-point inverse transform responsive to the control signal, and composing an N-point output vector in a first recomposition circuit, the first recomposition circuit coupled to receive a first (N/2)-point output vector from the first matrix multiplication circuit and a second (N/2)-point output vector from the forward and inverse (N/2)-point transform computation circuit, wherein the first recomposition circuit is operable to compose the N-point output vector from the first (N/2)-point output vector and the second (N/2)-point output vector, wherein, in response to the control signal, the N-point output vector is an output of the N-point forward transform computation or an output of the N-point inverse transform computation.

BRIEF DESCRIPTION OF THE DRAWINGS

Particular embodiments will now be described, by way of example only, and with reference to the accompanying drawings:

FIGS. 1A-1C illustrate symmetry of transform matrices;

FIG. 2 illustrates even-odd decomposition of the forward 4-pt transform;

FIG. 3 illustrates even-odd decomposition of the inverse 4-pt transform;

FIGS. 4 a and 4B show architectures of, respectively, the forward 4-pt transform implementation and the inverse 4-pt transform implementation using even-odd decomposition;

FIG. 5 illustrates the commonality between the even and odd matrices of the forward and inverse 4-pt transform even-odd decompositions;

FIG. 6 shows a unified architecture for computation of both forward and inverse 4-pt transforms with a set of inputs for the forward transform and a set of inputs for the inverse transform;

FIG. 7 shows a unified architecture for computation of both forward and inverse 4-pt transforms with a single set of inputs;

FIG. 8 illustrates even-odd decomposition of the forward 8-pt transform;

FIG. 9 shows an architecture for a forward 8-pt transform implementation using even-odd decomposition;

FIG. 10 illustrates even-odd decomposition of the inverse 8-pt transform;

FIG. 11 shows an architecture for an inverse 8-pt transform implementation using even-odd decomposition;

FIG. 12 illustrates the commonality between the even and odd matrices of the forward and inverse 8-pt transform even-odd decompositions;

FIG. 13 shows a unified architecture for computation of both forward and inverse 8-pt transforms with a set of inputs for the forward transform and a set of inputs for the inverse transform;

FIG. 14 shows a unified architecture for computation of both forward and inverse 16-pt transforms with a set of inputs for the forward transform and a set of inputs for the inverse transform;

FIG. 15 shows a unified architecture for computation of both forward and inverse 32-pt transforms with a set of inputs for the forward transform and a set of inputs for the inverse transform;

FIG. 16 illustrates the flow of forward transform computation in a unified 32-pt forward and inverse transform architecture;

FIG. 17 illustrates the flow of inverse transform computation in a unified 32-pt forward and inverse transform architecture;

FIG. 18 is a block diagram of a digital system;

FIG. 19 is a block diagram of a video encoder;

FIG. 20 is a block diagram of a video decoder; and

FIG. 21 is a flow diagram of a method;

DETAILED DESCRIPTION OF EMBODIMENTS OF THE INVENTION

Specific embodiments of the invention will now be described in detail with reference to the accompanying figures. Like elements in the various figures are denoted by like reference numerals for consistency.

As used herein, the term “picture” may refer to a frame or a field of a frame. A frame is a complete image captured during a known time interval. For convenience of description, embodiments of the invention are described herein in reference to HEVC. One of ordinary skill in the art will understand that embodiments of the invention are not limited to HEVC.

In HEVC, a largest coding unit (LCU) is the base unit used for block-based coding. A picture is divided into non-overlapping LCUs. That is, an LCU plays a similar role in coding as the macroblock of H.264/AVC, but it may be larger, e.g., 32×32, 64×64, etc. An LCU may be partitioned into coding units (CU). A CU is a block of pixels within an LCU and the CUs within an LCU may be of different sizes. The partitioning is a recursive quadtree partitioning. The quadtree is split according to various criteria until a leaf is reached, which is referred to as the coding node or coding unit. The maximum hierarchical depth of the quadtree is determined by the size of the smallest CU (SCU) permitted. The coding node is the root node of two trees, a prediction tree and a transform tree. A prediction tree specifies the position and size of prediction units (PU) for a coding unit. A transform tree specifies the position and size of transform units (TU) for a coding unit. A transform unit may not be larger than a coding unit. In recent specifications, the size of a square transform unit may be 4×4, 8×8, 16×16, and 32×32 and the size of a non-square transform may be 16×4, 4×16, 32×8, and 8×32. The sizes of the transforms units and prediction units for a CU are determined by the video encoder during prediction based on minimization of rate/distortion costs.

Various versions of HEVC are described in the following documents, which are incorporated by reference herein: T. Wiegand, et al., “WD3: Working Draft 3 of High-Efficiency Video Coding,” JCTVC-E603, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, Geneva, CH, Mar. 16-23, 2011 (“WD3”), B. Bross, et al., “WD4: Working Draft 4 of High-Efficiency Video Coding,” JCTVC-F803_d6, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, Torino, IT, Jul. 14-22, 2011 (“WD4”), B. Bross. et al., “WD5: Working Draft 5 of High-Efficiency Video Coding,” JCTVC-G1103_d9, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, Geneva, CH, Nov. 21-30, 2011 (“WD5”), B. Bross, et al., “High Efficiency Video Coding (HEVC) Text Specification Draft 6,” JCTVC-H1003, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG1, Geneva, CH, Nov. 21-30, 2011 (“HEVC Draft 6”), B. Bross, et al., “High Efficiency Video Coding (HEVC) Text Specification Draft 7,” JCTVC-I1003_d0, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG1, Geneva, CH, Apr. 17-May 7, 2012 (“HEVC Draft 7”), and B. Bross, et al., “High Efficiency Video Coding (HEVC) Text Specification Draft 8,” JCTVC-J1003_d7, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG1, Stockholm, SE, Jul. 11-20, 2012 (“HEVC Draft 8”).

Some aspects of this disclosure have been presented to the JCT-VC in M. Budagavi, “Hardware Analysis of Transform and Quantization,” JCTVC-G132, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, Geneva, CH, Nov. 21-30, 2011, which is incorporated by reference herein in its entirety.

Embodiments of the invention provide an architecture for joint computation of forward and inverse transforms. More specifically, an architecture is provided that exploits the symmetry properties of the core transform in HEVC and may be used to reduce the overall chip area needed for implementation of forward and inverse transforms. A general description of the core transform is provided herein. Additional detail may be found, for example, in A. Fuldseth, “CE10: Core Transform Design for HEVC,” JCTVC-G495, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, Geneva, CH, Nov. 21-30, 2011.

The core transform specified in HEVC is a DCT-like integer transform that can be represented by matrix multiplication. Unlike the H.264/AVC transform, the HEVC core transform has decoupled transform and quantization. The M×N core transforms can be implemented as M-point (M-pt) 1D transforms followed by N-pt 1D transforms. Both square and rectangular transforms can share the same 1D transform hardware. The 32-pt HEVC core transform matrix is defined by thirty-one 8-bit constants (ignoring sign bits)—C1, C2, . . . , C31—given by:

-   -   C1=90, C2=90, C3=90, C4=89, C5=88, C6=87, C7=85, C8=83, C9=82,         C10=80, C11=78, C12=75, C13=73, C14=70, C15=67, C16=64, C17=61,         C18=57, C19=54, C20=50, C21=46, C22=43, C23=38, C24=36, C25=31,         C26=25, C27=22, C28=18, C29=13, C30=9, C31=4.

This core transform has several useful symmetry properties that can be used to reduce implementation cost. For example, the even-odd symmetry in the transform matrix can be utilized to reduce implementation complexity. In another example, the 16×16, 8×8, and 4×4 transform matrices are subsets of the 32×32 transform matrix such that the smaller sized transforms are embedded within the next larger size transform and do not need separate implementation. FIGS. 1A to 1C illustrate this symmetry for 4×4, 8×8, and 16×16 matrices. The embedded values are shown in bold. In another example, there is symmetry between the forward transform and its inverse. These three symmetry properties are used to create an architecture that supports computation of both forward and inverse transforms in a unified fashion, i.e., much of the same hardware may be shared.

Let M=[M0, M1, M2, M3]^(T) be the input vector and P=[P0, P1, P2, P3]^(T) denote the output vector of the forward 4-pt transform. The forward 4-pt transform is defined by following equation:

P=D ₄ M  (1)

where D₄ is given by

$\begin{matrix} {D_{4} = \begin{bmatrix} {C\; 16} & {C\; 16} & {C\; 16} & {C\; 16} \\ {C\; 8} & {C\; 24} & {{- C}\; 24} & {{- C}\; 8} \\ {C\; 16} & {{- C}\; 16} & {{- C}\; 16} & {C\; 16} \\ {C\; 24} & {{- C}\; 8} & {C\; 8} & {{- C}\; 24} \end{bmatrix}} & (2) \end{matrix}$

Even-odd decomposition, also referred to as partial butterfly decomposition, may be used to perform the transform computation. For an N-pt forward transform of an N-pt input, even-odd decomposition involves the following three steps: 1) add/subtract the elements of the N-pt input vector to generate an N-pt intermediate vector; 2) calculate the even part of the output using an N/2×N/2 subset of the transform matrix obtained from the even rows of the transform matrix; and 3) calculate the odd part of the output using an N/2×N/2 subset of the transform matrix obtained from the odd rows of the transform matrix.

FIG. 2 illustrates the even-odd decomposition of the forward 4-pt transform. Computation of the direct 4-pt transform using Eq. 1 would require sixteen multiplications. In contrast, the even-odd decomposition computation requires only eight multiplications. FIG. 4A shows the architecture of a forward 4-pt transform implementation using even-odd decomposition.

The inverse 4-pt transform is defined by following equation:

Y=D ₄ ^(T) X  (3)

where X=[X0, X1, X2, X3]^(T) is the input vector and Y=[Y0, Y1, Y2, Y3]^(T) is the output of the 4-pt inverse transform. FIG. 3 illustrates the even-odd decomposition of the inverse 4-pt transform. FIG. 4B shows an example architecture of an inverse 4-pt transform implementation using even-odd decomposition. Assuming 16-bit inputs, the inverse transform uses 16-bit×8-bit multipliers whereas the forward transform uses 17-bit×8-bit multipliers since the inputs are added before multiplication in the forward transform.

For a unified forward and inverse transform implementation, additional symmetry between the forward and inverse transform matrices can be exploited to further reduce area. As is illustrated in FIG. 5, the even matrices of the forward and inverse transforms are identical and the odd matrices of the forward and inverse transforms are also identical if the inputs and outputs of the forward odd matrix are reversed. Because of this commonality, a hardware architecture that implements both the forward and inverse 4-pt transforms can share the hardware block that implements the even and odd matrix multiplications.

FIG. 6 shows a block diagram of an example architecture implementing a unified forward and inverse 4-pt transform with shared even and odd matrix multiplication circuits. The shared matrix multiplication circuits are labeled, respectively, as Even4 and Odd4. In some embodiments, this unified architecture uses 17-bit×8-bit multipliers. The number of multipliers used for the matrix multiplication circuits is implementation dependent. In some embodiments, each of the matrix multiplication circuits includes four multipliers. For example, eight 17-bit by 8-bit multipliers may be used to achieve a throughput of one 1D 4-pt transform per cycle.

The addition/subtraction logic (AddSub4) on the left implements the additions and subtractions of the 4-pt input vector M to generate the intermediate 4-pt vector K for the forward transform. The addition/subtraction logic on right implements the additions and subtractions of the 4-pt output vector Z to generate the output 4-pt vector Y for the inverse transform. A control signal (inv_fwd_flag) may be set to indicate whether the circuit behaves as a forward or an inverse transform. The multiplexors (Mux) and demultiplexors (Demux) switch up when a forward transform is indicated by the control signal and switch down when an inverse transform is indicated. When switched up, the multiplexors on the left select the outputs of the addition/subtraction network on the left and the demultiplexors on the right select the outputs of the matrix multiplication circuits as the outputs of the forward transform. When switched down, the mulitplexors on the left select the inverse transform inputs and the demultiplexors on the right send the outputs of the matrix multiplication circuits to the addition/subtraction network on the right for generation of the outputs of the inverse transform. The addition/subtraction logic on the left and the multiplexors may be referred to as a decomposition circuit. The addition/subtraction logic on the right and the demultiplexors may be referred to as a recomposition circuit.

Although not explicitly shown, the final outputs of the forward and inverse transform computations are rounded before being stored. The rounding circuit is also shared by the forward and inverse transforms.

FIG. 7 shows a block diagram of an example architecture implementing a unified forward and inverse 4-pt transform with even and odd matrix multiplication sharing and with a single set of inputs I=[I0, I1, I2, I3]. The inputs I=M for a forward transform computation and the inputs I=X for an inverse transform computation. The outputs for the forward transform computation are [O0, O1]=[P0, P2] and [O2, O3]=[P0, P3]. The outputs for the inverse transform computation are [O0, O1]=[Y0, Y1] and [O2, O3]=[Y2, Y3]. The intermediate outputs from the matrix multiplication circuits for the forward transform computation are [A0, A1]=[P0, P2] and [A2, A3]=[P0, P3]. The intermediate outputs from the matrix multiplication circuits for the inverse transform computation are [A0, A1]=[Z0, Z1] and [A2, A3]=[Z2, Z3].

The addition/subtraction logic (AddSub4) on the left implements the additions and subtractions of the 4-pt input vector Ito generate the intermediate 4-pt multiplicand vector for the forward transform. The addition/subtraction logic on right implements the additions and subtractions of the 4-pt output vector A to generate the output 4-pt vector O for the inverse transform. A control signal (inv_fwd_flag) may be set to indicate whether the circuit behaves as a forward or an inverse transform. The multiplexors (Mux) and demultiplexors (Demux) switch up when a forward transform is indicated by the control signal and switch down when an inverse transform is indicated. When switched up, the multiplexors on the left select the outputs of the addition/subtraction logic on the left and the demultiplexors on the right select the outputs of the multiplication circuits. When switched down, the multiplexors on the left select the inputs and the demultiplexors on the right select the outputs of the addition/subtraction logic on the right. The addition/subtraction logic on the left and the multiplexors may be referred to as a decomposition circuit. The addition/subtraction logic on the right and the demultiplexors may be referred to as a recomposition circuit.

Let M=[M0, . . . , M7]^(T) be the input vector and P=[P0, . . . , P7]^(T) denote the output of the forward 8-pt transform. The forward 8-pt transform is defined by following equation:

P=D ₈ M  (4)

where D₈ is given by

$\begin{matrix} {D_{8} = \begin{bmatrix} {C\; 16} & {C\; 16} & {C\; 16} & {C\; 16} & {C\; 16} & {C\; 16} & {C\; 16} & {C\; 16} \\ {C\; 4} & {C\; 12} & {C\; 20} & {C\; 28} & {{- C}\; 28} & {{- C}\; 20} & {{- C}\; 12} & {{- C}\; 4} \\ {C\; 8} & {C\; 24} & {{- C}\; 24} & {{- C}\; 8} & {{- C}\; 8} & {{- C}\; 24} & {C\; 24} & {C\; 8} \\ {C\; 12} & {{- C}\; 28} & {{- C}\; 4} & {{- C}\; 20} & {C\; 20} & {C\; 4} & {C\; 28} & {{- C}\; 12} \\ {C\; 16} & {{- C}\; 16} & {{- C}\; 16} & {C\; 16} & {C\; 16} & {{- C}\; 16} & {{- C}\; 16} & {C\; 16} \\ {C\; 20} & {{- C}\; 4} & {C\; 28} & {C\; 12} & {{- C}\; 12} & {{- C}\; 28} & {C\; 4} & {{- C}\; 20} \\ {C\; 24} & {{- C}\; 8} & {C\; 8} & {{- C}\; 24} & {{- C}\; 24} & {C\; 8} & {{- C}\; 8} & {C\; 24} \\ {C\; 28} & {{- C}\; 20} & {C\; 12} & {{- C}\; 4} & {C\; 4} & {{- C}\; 12} & {C\; 20} & {{- C}\; 28} \end{bmatrix}} & (5) \end{matrix}$

FIG. 8 illustrates the even-odd decomposition of the forward 8-pt transform. Computation of the direct 8-pt transform using Eq. 4 would require 64 multiplications. In contrast, the even-odd decomposition computation may require a maximum of 32 multiplications. The number of multiplications can be reduced if the even matrix is further decomposed. FIG. 9 shows an example architecture of a forward 8-pt transform implementation using even-odd decomposition.

The inverse 8-pt transform is defined by following equation:

Y=D ₈ ^(T) X  (3)

where X=[X0, . . . , X7]^(T) is the input vector and Y=[Y0, . . . , Y7]^(T) is the output of the 8-pt inverse transform. FIG. 10 illustrates the even-odd decomposition of the inverse 8-pt transform. FIG. 11 shows an example architecture of an inverse 8-pt transform implementation using even-odd decomposition. As with the 4-pt architectures, assuming 16-bit inputs, the inverse transform may use 16-bit×8-bit multipliers whereas the forward transform may use 17-bit×8-bit multipliers since the inputs are added before multiplication in the forward transform.

The even matrix of the 8-pt forward transform of FIG. 8 is identical to the 4-pt forward transform of Eq. 2 and the even matrix of the 8-pt inverse transform of FIG. 10 is identical to the 4-pt inverse transform of Eq. 4. Thus, the unified 4-pt transform architecture of FIG. 6 can be used to implement the even parts of the 8-pt forward and inverse transforms. Further, as illustrated in FIG. 12, the odd matrix of the forward 8-pt transform and the odd matrix of the inverse 8-pt transform have identical multiplicands which differ in sign for half of the elements. The elements with the differing signs are circled in the odd matrix of the forward transform.

FIG. 13 shows a block diagram of an example architecture implementing a unified forward and inverse 8-pt transform. The architecture is similar to that of FIG. 6 for the 4-pt transform. The even and odd matrix multiplication circuits are shared for the computation of the forward and inverse transforms. A control signal (inv_fwd_flag) may be set to indicate whether the circuit behaves as a forward or an inverse transform. The even matrix multiplication circuit (Unified 4-Pt) is implemented as the unified 4-pt architecture of FIG. 6, i.e., is a forward and inverse 4-pt transform computation circuit. The odd matrix multiplication circuit (Odd8) implements matrix multiplication with the 8-pt odd matrix. The odd matrix contains the shared transform coefficients of the forward and inverse 8-pt odd matrices. Note that the architecture of FIG. 13 shows hardware sharing for the forward and inverse 8-pt transforms as well as hardware sharing between the forward and inverse 4-pt transforms and the forward and inverse 8-pt transforms.

The constant s appears beside each coefficient in which the sign differs between the forward and inverse 8-pt odd matrices. The value of s may be changed responsive to the control signal to change the signs of these coefficients. When the control signal indicates the computation of a forward transform, the value of s is −1 and when the control signal indicates the computation of an inverse transform, the value of s is 1. Alternatively, the coefficients with “s” can be multiplied first and summed and the sign can be changed for the final sum of product terms. For example, the multiplication of the first column [−c28 s*c20−c12 s*c4] with a four point vector, e.g., X0, X1, X2, X3, can be carried as −c28*X0−c12*X2+s(c20*X1+c4*×3). The multiplication and accumulation of X1 and X3 with c20 and c4 can be carried out first and then the sign can be changed instead of changing the sign of c20 and c4 first before multiplication.

The addition/subtraction logic (AddSub8) on the left implements the additions and subtractions of the 8-pt input vector M to generate the intermediate 8-pt multiplicand vector for the forward transform. The addition/subtraction logic on right implements the additions and subtractions of the 8-pt output vector Z to generate the output 8-pt vector Y for the inverse transform. The multiplexors (Mux) and demultiplexors (Demux) switch up when a forward transform is indicated by the control signal and switch down when an inverse transform is indicated. When switched up, the multiplexors on the left select the outputs of the addition/subtraction logic on the left and the demultiplexors on the right select the outputs of the matrix multiplication circuits as the outputs of the forward transform. When switched down, the mulitplexors on the left select the inverse transform inputs and the demultiplexors on the right send the outputs of the matrix multiplication circuits to the addition/subtraction logic on the right for generation of the outputs of the inverse transform. The addition/subtraction logic on the left and the multiplexors may be referred to as a decomposition circuit. The addition/subtraction logic on the right and the demultiplexors may be referred to as a recomposition circuit.

Although not explicitly shown, the final outputs of the forward and inverse transform computations are rounded before being stored. The rounding circuit is also shared by the forward and inverse transforms.

The architecture of FIG. 13 includes separate inputs for the forward and inverse transforms. This architecture may be modified to have shared inputs for the forward and inverse transforms in a similar fashion to the modifications made to convert the separate input architecture of FIG. 6 to the shared input architecture of FIG. 7.

The architecture of FIG. 13 can be extended for larger transforms, e.g., for N=16, 32, etc. The even matrix of the 16-pt forward transform is identical to the 8-pt forward transform and the even matrix of the 16-pt inverse transform is identical to the 8-pt inverse transform. Further, the forward and inverse odd matrices have identical multiplicands, some of which differ in sign. The even matrix of the 32-pt forward transform is identical to the 16-pt forward transform and the even matrix of the 32-pt inverse transform is identical to the 16-pt inverse transform. Further, the forward and inverse odd matrices have identical multiplicands, some of which differ in sign. The sign differences may be handled in a similar fashion to that described for the 8-pt transform architecture.

FIG. 14 shows a block diagram of an example architecture implementing a unified forward and inverse 16-pt transform. The even matrix multiplication circuit (Unified 8-Pt) is implemented as the unified 8-pt architecture of FIG. 13, i.e., is a forward and inverse 8-pt transform computation circuit. Note that the architecture of FIG. 14 shows hardware sharing for the forward and inverse 16-pt transforms, hardware sharing between the forward and inverse 8-pt transforms and the forward and inverse 16-pt transforms, hardware sharing for the forward and inverse 8-pt transforms, and hardware sharing between the forward and inverse 4-pt transforms and the forward and inverse 8-pt transforms. The addition/subtraction logic on the left and the multiplexors may be referred to as a decomposition circuit. The addition/subtraction logic on the right and the demultiplexors may be referred to as a recomposition circuit.

FIG. 15 shows a block diagram of an example architecture implementing a unified forward and inverse 32-pt transform. The even matrix multiplication circuit (Unified 16-Pt) is implemented as the unified 16-pt architecture of FIG. 14, i.e., is a forward and inverse 16-pt transform computation circuit. Note that the architecture of FIG. 15 shows hardware sharing for the forward and inverse 32-pt transforms, hardware sharing between the forward and inverse 16-pt transforms and the forward and inverse 32-pt transforms, hardware sharing for the forward and inverse 16-pt transforms, hardware sharing between the forward and inverse 8-pt transforms and the forward and inverse 16-pt transforms, hardware sharing for the forward and inverse 8-pt transforms, and hardware sharing between the forward and inverse 4-pt transforms and the forward and inverse 8-pt transforms. The addition/subtraction logic on the left and the multiplexors may be referred to as a decomposition circuit. The addition/subtraction logic on the right and the demultiplexors may be referred to as a recomposition circuit.

The architectures of FIGS. 14 and 15 include separate inputs for the forward and inverse transforms. These architectures may be modified to have shared inputs for the forward and inverse transforms in a similar fashion to the modifications made to convert the separate input architecture of FIG. 6 to the shared input architecture of FIG. 7. Further, although not explicitly shown, the final outputs of the forward and inverse transform computations are rounded before being stored. The rounding circuit is also shared by the forward and inverse transforms.

FIG. 16 illustrates the flow of a forward N-point transform computation in the unified forward and inverse transform architecture of FIG. 15. The flow is explained for a 32-pt forward transform computation. Let M=[M0, M1, . . . , M3]^(T) denote the input vector and P=[P0, P1, . . . , P31]^(T) denote the output vector of the forward 32-pt transform. For a 32-pt forward transform computation, the elements of the 32-pt input vector M₃₂ are the inputs for the addition and subtraction logic (AddSub32) of the 32-pt forward transform architecture. The output of the AddSub32 logic, the 32-pt intermediate multiplicand vector D=[D0, D1, . . . , D31], is decomposed such that the first sixteen elements [D0, D1, . . . , D15] are the inputs for the addition and subtraction logic (AddSub16) of the 16-pt forward transform architecture and the last sixteen elements [D16, D17, . . . , D31] are the inputs for the Odd32 multiplication circuit. The outputs of the Odd32 multiplication circuit are the sixteen odd elements of the 32-pt output vector P, i.e.,

$\begin{bmatrix} {P\; 1} \\ {P\; 3} \\ {P\; 5} \\ \vdots \\ {P\; 31} \end{bmatrix} = {{\left\lbrack {{Odd}\mspace{14mu} 32} \right\rbrack \begin{bmatrix} {D\; 16} \\ {D\; 17} \\ {D\; 18} \\ \vdots \\ {D\; 31} \end{bmatrix}}.}$

The output of the AddSub16 logic, the 16-pt intermediate multiplicand vector E=[E0, E1, . . . , E15], is decomposed such that the first eight elements [E0, E1, . . . , E7] are the inputs for the addition and subtraction logic (AddSub8) of the 8-pt forward transform architecture and the last eight elements [E8, E9, . . . , E15] are the inputs for the Odd16 multiplication circuit. The outputs of the Odd16 multiplication circuit are every fourth even element of the 32-pt output vector P starting, with P2, i.e.,

$\begin{bmatrix} {P\; 2} \\ {P\; 6} \\ {P\; 10} \\ \vdots \\ {P\; 30} \end{bmatrix} = {{\left\lbrack {{Odd}\mspace{14mu} 16} \right\rbrack \begin{bmatrix} {E\; 8} \\ {E\; 9} \\ {E\; 10} \\ \vdots \\ {E\; 15} \end{bmatrix}}.}$

The output of the AddSub8 logic, the 8-pt intermediate multiplicand vector F=[F0, F1, . . . , F7], is decomposed such that the first four elements [F0, F1, F2, F3] are the inputs for the addition and subtraction logic (AddSub4) of the 4-pt forward transform architecture and the last four elements [F4, F5, F6, F7] are the inputs for the Odd8 multiplication circuit. The outputs of the Odd8 multiplication circuit are every eighth even element of the 32-pt output vector P starting with P4, i.e.,

$\begin{bmatrix} {P\; 4} \\ {P\; 12} \\ {P\; 20} \\ {P\; 28} \end{bmatrix} = {{\left\lbrack {{Odd}\mspace{14mu} 8} \right\rbrack \begin{bmatrix} {F\; 4} \\ {F\; 5} \\ {F\; 6} \\ {F\; 7} \end{bmatrix}}.}$

The output of the AddSub4 logic, the 4-pt intermediate multiplicand vector G=[G0, G1, G2, G3], is decomposed such that the first two elements [G0, G1] are the inputs for the Even4 multiplication circuit of the 4-pt forward transform architecture and the last two elements [G2, G3] are the inputs for the Odd4 multiplication circuit. The outputs of the Odd4 multiplication circuit are the first and seventeenth elements, P0 and P16, of the 32-pt output vector P and the outputs of the Even4 multiplication circuit are the ninth and twenty-fifth elements, P8 and P24, of the 32-pt output vector P, i.e.,

$\begin{bmatrix} {P\; 0} \\ {P\; 16} \end{bmatrix} = {{{\left\lbrack {{Even}\mspace{14mu} 4} \right\rbrack \begin{bmatrix} {G\; 0} \\ {G\; 1} \end{bmatrix}}\begin{bmatrix} {P\; 8} \\ {P\; 24} \end{bmatrix}} = {{\left\lbrack {{Odd}\mspace{14mu} 4} \right\rbrack \begin{bmatrix} {G\; 2} \\ {G\; 3} \end{bmatrix}}.}}$

Smaller forward transforms may be computed using the architecture of FIG. 15. For example, to compute a 16-pt forward transform with an input vector of [M0, M1, . . . , M15], the actual input vector may be a 32-pt vector [M0, M1, . . . , M15, 0, 0, . . . , 0] and the output results at P2, P4, P6, P8, . . . , P30 may be read. Two possible ways to input [M0, M1, . . . , M15, 0, 0, . . . , 0] are to input the actual values or to have a control flag that may be set to bypass the inputs for M16, M17, . . . , M31 and set them to 0. Two possible ways to get the output are to read the final 32-point output and pick P2, P4, P6, P8, etc. or to tap out the output of Even4, Odd4, Odd8, Odd16 without activating the output of Odd32. An 8-pt forward transform or a 4-pt forward transform may be similarly computed.

FIG. 17 illustrates the flow of an inverse N-point transform computation in the unified forward and inverse transform architecture of FIG. 15. The flow is explained for a 32-pt inverse transform computation. Let X=[0, X1, . . . , X31]^(T) denote the input vector, Z=[Z0, Z1, . . . , Z31] denote the intermediate output vector, and Y=[Y0, Y1, . . . , Y31]^(T) denote the output vector of the inverse 32-pt transform. For a 32-pt inverse transform computation, the 32-pt input vector X is decomposed into five vectors for inputs to the Even4, Odd4, Odd8, Odd16, and Odd32 matrix multiplication circuits. The inputs for these matrix multiplication circuits are, respectively, [X0, X16], [X8, X24], [X4, X12, X20, X28], [X2, X6, X10, . . . , X30], and [X1, X3, X5, . . . , X31].

The outputs of the Even4 multiplication circuit are

$\begin{bmatrix} {U\; 0} \\ {U\; 1} \end{bmatrix} = {\left\lbrack {{Even}\mspace{14mu} 4} \right\rbrack \begin{bmatrix} {X\; 0} \\ {X\; 16} \end{bmatrix}}$

and the outputs of the Odd4 multiplication circuit are

$\begin{bmatrix} {U\; 2} \\ {U\; 3} \end{bmatrix} = {{\lbrack{Odd}\rbrack \begin{bmatrix} {X\; 8} \\ {X\; 24} \end{bmatrix}}.}$

These outputs form the input vector U for the AddSub4 logic. The outputs of the AddSub4 logic are the first four elements [V0, V1, V2, V3] of the intermediate output vector V of the 8-pt inverse transform computation. The outputs of the Odd8 multiplication circuit are the last four elements of the intermediate output vector V, i.e.,

$\begin{bmatrix} {V\; 4} \\ {V\; 5} \\ {V\; 6} \\ {V\; 7} \end{bmatrix} = {{\left\lbrack {{Odd}\mspace{14mu} 8} \right\rbrack \begin{bmatrix} {X\; 4} \\ {X\; 12} \\ {X\; 20} \\ {X\; 28} \end{bmatrix}}.}$

The elements of the intermediate output vector V are the inputs to the AddSub8 logic. The outputs of the AddSub8 logic are the first eight elements [W0, W1, . . . , W7] of the intermediate output vector W of the 16-pt inverse transform computation. The outputs of the Odd16 multiplication circuit are the last eight elements of the intermediate output vector W, i.e.,

$\begin{bmatrix} {W\; 8} \\ {W\; 9} \\ {W\; 10} \\ \vdots \\ {W\; 15} \end{bmatrix} = {{\left\lbrack {{Odd}\mspace{20mu} 16} \right\rbrack \begin{bmatrix} {X\; 2} \\ {X\; 6} \\ {X\; 10} \\ \vdots \\ {X\; 30} \end{bmatrix}}.}$

The elements of the intermediate output vector W are the inputs to the AddSub16 logic. The outputs of the AddSub16 logic are the first sixteen elements [Z0, Z1, . . . , Z15] of the intermediate output vector Z of the 32-pt inverse transform computation. The outputs of the Odd32 multiplication circuit are the last sixteen elements of the intermediate output vector Z, i.e.,

$\begin{bmatrix} {Z\; 16} \\ {Z\; 17} \\ {Z\; 18} \\ \vdots \\ {Z\; 31} \end{bmatrix} = {{\left\lbrack {{Odd}\mspace{14mu} 32} \right\rbrack \begin{bmatrix} {X\; 1} \\ {X\; 3} \\ {X\; 5} \\ \vdots \\ {X\; 31} \end{bmatrix}}.}$

The elements of the output vector z are the inputs to the AddSub32 logic. The outputs of the AddSub32 logic form the 32-pt output vector Y.

Smaller inverse transforms may be computed using the architecture of FIG. 15. For example, to compute a 16-pt inverse transform with an input vector of [X0, X1, . . . , X15], the actual input vector may be a 32-pt vector [X0, X1, . . . , X15, 0, 0, . . . , 0] and the outputs for Y0, Y1, . . . , Y15 may be read and the rest, which will all be 0, ignored. Two possible ways to input [X0, X1, . . . , X15, 0, 0, . . . , 0] are to input the actual values or to have a control flag that may be set to bypass the inputs for X16, X17, . . . , X31 and set them to 0. An 8-pt inverse transform or a 4-pt inverse transform may be similarly computed.

For the inverse N-pt transform computation of FIG. 17, the addition and subtraction logic comes after the multiplication circuits. Thus, the multiplication circuits Odd32, Odd16, Odd8, and Odd4 can be implemented 16×8 multipliers. For the forward N-pt transform computation of FIG. 16, the addition and subtraction logic comes before the matrix multiplication circuits, so the Odd32 multiplication circuit can be implemented with 17×8 multipliers, the Odd16 multiplication circuit can be implemented with 18×8 multipliers, the Odd8 multiplication circuit can be implemented with 19×8 multipliers, and the Odd4 multiplication circuit can be implemented with 20×8 multipliers.

FIG. 18 shows a block diagram of a digital system that includes a source digital system 1800 that transmits encoded video sequences to a destination digital system 1802 via a communication channel 1816. The source digital system 1800 includes a video capture component 1804, a video encoder component 1806, and a transmitter component 1808. The video capture component 1804 is configured to provide a video sequence to be encoded by the video encoder component 1806. The video capture component 1804 may be, for example, a video camera, a video archive, or a video feed from a video content provider. In some embodiments, the video capture component 1804 may generate computer graphics as the video sequence, or a combination of live video, archived video, and/or computer-generated video.

The video encoder component 1806 receives a video sequence from the video capture component 1804 and encodes it for transmission by the transmitter component 1808. The video encoder component 1806 receives the video sequence from the video capture component 1804 as a sequence of pictures, divides the pictures into largest coding units (LCUs), and encodes the video data in the LCUs. As part of the encoding process, the video encoder component 1806 may compute forward and inverse transforms using a unified forward and inverse transform architecture as described herein. An embodiment of the video encoder component 1806 is described in more detail herein in reference to FIG. 19.

The transmitter component 1808 transmits the encoded video data to the destination digital system 1802 via the communication channel 1816. The communication channel 1816 may be any communication medium, or combination of communication media suitable for transmission of the encoded video sequence, such as, for example, wired or wireless communication media, a local area network, or a wide area network.

The destination digital system 1802 includes a receiver component 1810, a video decoder component 1812 and a display component 1814. The receiver component 1810 receives the encoded video data from the source digital system 1800 via the communication channel 1816 and provides the encoded video data to the video decoder component 1812 for decoding. The video decoder component 1812 reverses the encoding process performed by the video encoder component 1806 to reconstruct the LCUs of the video sequence. An embodiment of the video decoder component 1812 is described in more detail below in reference to FIG. 20.

The reconstructed video sequence is displayed on the display component 1814. The display component 1814 may be any suitable display device such as, for example, a plasma display, a liquid crystal display (LCD), a light emitting diode (LED) display, etc.

In some embodiments, the source digital system 1800 may also include a receiver component and a video decoder component and/or the destination digital system 1802 may include a transmitter component and a video encoder component for transmission of video sequences both directions for video steaming, video broadcasting, and video telephony. In such embodiments, the video encoder component and the video decoder component may share the same hardware for computation of forward and inverse transforms. That is, the video encoder component may compute forward and inverse transforms using a unified forward and inverse transform architecture as described herein and the video decoder component may compute inverse transformations using the unified forward and inverse transform architecture. Further, the video encoder component 1806 and the video decoder component 1812 may perform encoding and decoding in accordance with one or more video compression standards. The video encoder component 1806 and the video decoder component 1812 may be implemented in any suitable combination of software, firmware, and hardware, such as, for example, one or more digital signal processors (DSPs), microprocessors, discrete logic, application specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), etc.

FIG. 19 is a block diagram of the LCU processing portion of an example video encoder. A coding control component (not shown) sequences the various operations of the LCU processing, i.e., the coding control component runs the main control loop for video encoding. The coding control component receives a digital video sequence and performs any processing on the input video sequence that is to be done at the picture level, such as determining the coding type (I, P, or B) of a picture based on the high level coding structure, e.g., IPPP, IBBP, hierarchical-B, and dividing a picture into LCUs for further processing.

In addition, for pipelined architectures in which multiple LCUs may be processed concurrently in different components of the LCU processing, the coding control component controls the processing of the LCUs by various components of the LCU processing in a pipeline fashion. For example, in many embedded systems supporting video processing, there may be one master processor and one or more slave processing modules, e.g., hardware accelerators. The master processor operates as the coding control component and runs the main control loop for video encoding, and the slave processing modules are employed to off load certain compute-intensive tasks of video encoding such as motion estimation, motion compensation, intra prediction mode estimation, transformation and quantization, entropy coding, and loop filtering. The slave processing modules are controlled in a pipeline fashion by the master processor such that the slave processing modules operate on different LCUs of a picture at any given time. That is, the slave processing modules are executed in parallel, each processing its respective LCU while data movement from one processor to another is serial.

The LCU processing receives LCUs 1900 of the input video sequence from the coding control component and encodes the LCUs 1900 under the control of the coding control component to generate the compressed video stream. The LCUs 1900 in each picture are processed in row order. The LCUs 1900 from the coding control component are provided as one input of a motion estimation component (ME) 1920, as one input of an intra-prediction estimation component (IPE) 1924, and to a positive input of a combiner 1902 (e.g., adder or subtractor or the like). Further, although not specifically shown, the prediction mode of each picture as selected by the coding control component is provided to a mode decision component 1928 and the entropy coding component 1936.

The storage component 1918 provides reference data to the motion estimation component 1920 and to the motion compensation component 1922. The reference data may include one or more previously encoded and decoded pictures, i.e., reference pictures.

The motion estimation component 1920 provides motion data information to the motion compensation component 1922 and the entropy coding component 1936. More specifically, the motion estimation component 1920 performs tests on CUs in an LCU based on multiple inter-prediction modes (e.g., skip mode, merge mode, and normal or direct inter-prediction), PU sizes, and TU sizes using reference picture data from storage 1918 to choose the best CU partitioning, PU/TU partitioning, inter-prediction modes, motion vectors, etc. based on coding cost, e.g., a rate distortion coding cost. To perform the tests, the motion estimation component 1920 may divide an LCU into CUs according to the maximum hierarchical depth of the quadtree, and divide each CU into PUs according to the unit sizes of the inter-prediction modes and into TUs according to the transform unit sizes, and calculate the coding costs for each PU size, prediction mode, and transform unit size for each CU. The motion estimation component 1920 provides the motion vector (MV) or vectors and the prediction mode for each PU in the selected CU partitioning to the motion compensation component (MC) 1922.

The motion compensation component 1922 receives the selected inter-prediction mode and mode-related information from the motion estimation component 1920 and generates the inter-predicted CUs. The inter-predicted CUs are provided to the mode decision component 1928 along with the selected inter-prediction modes for the inter-predicted PUs and corresponding TU sizes for the selected CU/PU/TU partitioning. The coding costs of the inter-predicted CUs are also provided to the mode decision component 1928.

The intra-prediction estimation component 1924 (IPE) performs intra-prediction estimation in which tests on CUs in an LCU based on multiple intra-prediction modes, PU sizes, and TU sizes are performed using reconstructed data from previously encoded neighboring CUs stored in a buffer (not shown) to choose the best CU partitioning, PU/TU partitioning, and intra-prediction modes based on coding cost, e.g., a rate distortion coding cost. To perform the tests, the intra-prediction estimation component 1924 may divide an LCU into CUs according to the maximum hierarchical depth of the quadtree, and divide each CU into PUs according to the unit sizes of the intra-prediction modes and into TUs according to the transform unit sizes, and calculate the coding costs for each PU size, prediction mode, and transform unit size for each PU. The intra-prediction estimation component 1924 provides the selected intra-prediction modes for the PUs, and the corresponding TU sizes for the selected CU partitioning to the intra-prediction component (IP) 1926. The coding costs of the intra-predicted CUs are also provided to the intra-prediction component 1926.

The intra-prediction component 1926 (IP) receives intra-prediction information, e.g., the selected mode or modes for the PU(s), the PU size, etc., from the intra-prediction estimation component 1924 and generates the intra-predicted CUs. The intra-predicted CUs are provided to the mode decision component 1928 along with the selected intra-prediction modes for the intra-predicted PUs and corresponding TU sizes for the selected CU/PU/TU partitioning. The coding costs of the intra-predicted CUs are also provided to the mode decision component 1928.

The mode decision component 1928 selects between intra-prediction of a CU and inter-prediction of a CU based on the intra-prediction coding cost of the CU from the intra-prediction component 1926, the inter-prediction coding cost of the CU from the motion compensation component 1922, and the picture prediction mode provided by the coding control component. Based on the decision as to whether a CU is to be intra- or inter-coded, the intra-predicted PUs or inter-predicted PUs are selected. The selected CU/PU/TU partitioning with corresponding modes and other mode related prediction data (if any) such as motion vector(s) and reference picture index (indices), are provided to the entropy coding component 1936.

The output of the mode decision component 1928, i.e., the predicted PUs, is provided to a negative input of the combiner 1902 and to the combiner 1938. The associated transform unit size is also provided to the transform component 1904. The combiner 1902 subtracts a predicted PU from the original PU. Each resulting residual PU is a set of pixel difference values that quantify differences between pixel values of the original PU and the predicted PU. The residual blocks of all the PUs of a CU form a residual CU for further processing.

The transform component 1904 performs block transforms on the residual CUs to convert the residual pixel values to transform coefficients and provides the transform coefficients to a quantize component 1906. More specifically, the transform component 1904 receives the transform unit sizes for the residual CU and applies transforms of the specified sizes to the CU to generate transform coefficients. The transform component 1904 may perform the transform computations using a unified forward and inverse transform architecture as described herein. Further, the quantize component 1906 quantizes the transform coefficients based on quantization parameters (QPs) and quantization matrices provided by the coding control component and the transform sizes and provides the quantized transform coefficients to the entropy coding component 1936 for coding in the bit stream.

The entropy coding component 1936 entropy encodes the relevant data, i.e., syntax elements, output by the various encoding components and the coding control component using context-adaptive binary arithmetic coding (CABAC) to generate the compressed video bit stream. Among the syntax elements that are encoded are picture parameter sets, flags indicating the CU/PU/TU partitioning of an LCU, the prediction modes for the CUs, and the quantized transform coefficients for the CUs. The entropy coding component 1936 also codes relevant data such as ALF parameters, e.g., filter type, on/off flags, and filter coefficients, and SAO parameters, e.g., filter type, on/off flags, and offsets as needed.

The LCU processing component 1942 includes an embedded decoder. As any compliant decoder is expected to reconstruct an image from a compressed bit stream, the embedded decoder provides the same utility to the video encoder. Knowledge of the reconstructed input allows the video encoder to transmit the appropriate residual energy to compose subsequent pictures.

The quantized transform coefficients for each CU are provided to an inverse quantize component (IQ) 1912, which outputs a reconstructed version of the transform result from the transform component 1904. The dequantized transform coefficients are provided to the inverse transform component (IDCT) 1914, which outputs estimated residual information representing a reconstructed version of a residual CU. The inverse transform component 1914 receives the transform unit size used to generate the transform coefficients and applies inverse transform(s) of the specified size to the transform coefficients to reconstruct the residual values. The inverse transform component 1914 may perform the inverse transform computations using the same unified forward and inverse transform architecture as the transform component 1904. The reconstructed residual CU is provided to the combiner 1938.

The combiner 1938 adds the original predicted CU to the residual CU to generate a reconstructed CU, which becomes part of reconstructed picture data. The reconstructed picture data is stored in a buffer (not shown) for use by the intra-prediction estimation component 1924.

Various in-loop filters may be applied to the reconstructed picture data to improve the quality of the reference picture data used for encoding/decoding of subsequent pictures. The in-loop filters may include a deblocking filter 1930, a sample adaptive offset filter (SAO) 1932, and an adaptive loop filter (ALF) 1934. In some embodiments, the ALF 1934 may not be present. The in-loop filters 1930, 1932, 1934 are applied to each reconstructed LCU in the picture and the final filtered reference picture data is provided to the storage component 1918.

FIG. 20 is a block diagram of an example video decoder. The entropy decoding component 2000 receives an entropy encoded (compressed) video bit stream and reverses the entropy encoding using CABAC decoding to recover the encoded syntax elements, e.g., CU, PU, and TU structures of LCUs, quantized transform coefficients for CUs, motion vectors, prediction modes, lossless coding flags (if present), etc. The decoded syntax elements are passed to the various components of the decoder as needed. For example, decoded prediction modes are provided to the intra-prediction component (IP) 2014 or motion compensation component (MC) 2010. If the decoded prediction mode is an inter-prediction mode, the entropy decoder 2000 reconstructs the motion vector(s) as needed and provides the motion vector(s) to the motion compensation component 2010.

The inverse quantize component (IQ) 2002 de-quantizes the quantized transform coefficients of the CUs. The inverse transform component 2004 transforms the frequency domain data from the inverse quantize component 2002 back to the residual CUs. That is, the inverse transform component 2004 applies an inverse unit transform, i.e., the inverse of the unit transform used for encoding, to the de-quantized residual coefficients to produce reconstructed residual values of the CUs. The inverse transform component 2004 may perform the inverse transform computations using the same unified forward and inverse transform architecture as the transform component 1904 and the inverse transform component 1914 of the video encoder.

A residual CU supplies one input of the addition component 2006. The other input of the addition component 2006 comes from the mode switch 2008. When an inter-prediction mode is signaled in the encoded video stream, the mode switch 2008 selects predicted PUs from the motion compensation component 2010 and when an intra-prediction mode is signaled, the mode switch selects predicted PUs from the intra-prediction component 2014.

The motion compensation component 2010 receives reference data from the storage component 2012 and applies the motion compensation computed by the encoder and transmitted in the encoded video bit stream to the reference data to generate a predicted PU. That is, the motion compensation component 2010 uses the motion vector(s) from the entropy decoder 2000 and the reference data to generate a predicted PU.

The intra-prediction component 2014 receives reconstructed samples from previously reconstructed PUs of a current picture from the storage component 2012 and performs the intra-prediction computed by the encoder as signaled by an intra-prediction mode transmitted in the encoded video bit stream using the reconstructed samples as needed to generate a predicted PU.

The addition component 2006 generates a reconstructed CU by adding the predicted PUs selected by the mode switch 2008 and the residual CU. The output of the addition component 2006, i.e., the reconstructed CUs, is stored in the storage component 2012 for use by the intra-prediction component 2014.

In-loop filters may be applied to reconstructed picture data to improve the quality of the decoded pictures and the quality of the reference picture data used for decoding of subsequent pictures. The in-loop filters are the same as those of the encoder, i.e., a deblocking filter 2016, a sample adaptive offset filter (SAO) 2018, and an adaptive loop filter (ALF) 2020. In some embodiments, the ALF 2020 may not be present. The in-loop filters may be applied on an LCU-by-LCU basis and the final filtered reference picture data is provided to the storage component 2012.

FIG. 21 is a flow diagram of a method for unified computation of forward and inverse N-pt transforms. Initially, an N-pt input vector I is received 2100 and the variable P is set to the value of N. If computation of an inverse transform is indicated 2102, the input vector I is decomposed into two vectors I_(E) and I_(O) where the even elements of I form the elements of I_(E) and the odd elements of I form the elements of I_(O). If computation of a forward transform is indicated 2102, the elements of I are added/subtracted 2106 to generate an intermediate P-pt multiplicand vector. The intermediate P-pt multiplicand vector is decomposed into two vectors I_(E) and I_(O) where first P/2 elements of the intermediate multiplicand vector form the elements of I_(E) and the second P/2 elements of the intermediate multiplicand vector form the elements of I_(O).

Matrix multiplication is then performed to multiply I_(O) and the P-pt transform odd matrix. As previously described herein, the P-pt transform odd matrix may be the same for both the forward and inverse P-pt transform computations with some sign differences. The sign differences may be handled as previously described herein. The results of this matrix multiplication are saved in an interim N-pt vector A. The particular outputs generated by this matrix multiplication for each transform size and their mapping to positions in the output vector for forward transforms are previously described herein in reference to FIG. 16 and for inverse transforms are previously described herein in reference to FIG. 17.

If P is greater than 4 2112, then P is set to P divided by 2, I is set to I_(E), and 2102-2108 is repeated. Steps 2102-2110 are repeated until P is equal to 4.

When P is equal to 4 2112, matrix multiplication is then performed 2114 to multiply I_(E) and the P-pt transform even matrix. The results of this matrix multiplication are saved in the interim vector A. The particular outputs generated by this matrix multiplication for a 4-pt transform computation and their mapping to positions in the output vector for forward transforms are previously described herein in reference to FIG. 16 and for inverse transforms are previously described herein in reference to FIG. 17. If the computation is of an N-pt inverse transform 2116, the elements of A are added/subtracted 2118 to generate the N-pt output vector. Otherwise, the interim vector A is the N-pt output vector 2120.

The unified forward and inverse transform architecture as per FIG. 15 was implemented using Verilog for a throughput of one 32-pt 1D transform per cycle. A 32×32 2D transform requires 64 cycles. Separate forward and inverse transforms were also implemented. The implementations were synthesized in 45-nm CMOS. Table 1 lists the area estimates (in kgates) at 250 MHz for the separate and unified implementations. The unified forward and inverse transform implementation requires around 44% less area than the separate forward transform and inverse transform implementations. The hardware area savings at other frequencies were in the range of 43-45%.

TABLE 1 Separate Unified % Area Freq Fwd Inv Fwd + Inv Fwd + Inv savings 250 148 130 278 156 44%

Table 2 provides the area breakdown of different components of the 32-pt unified forward and inverse transform implementation. As described herein, an N-pt transform implementation includes three primary components: N/2-pt transform logic, N-pt odd matrix multiplication logic, addition/subtraction logic for N inputs for the forward transform, and addition/subtraction logic for N outputs for the inverse transform. Hence smaller size transforms do not need separate implementation leading to area savings. In this table, the area for each AddSub<N> is for two sets of addition/subtraction logic.

TABLE 2 % Area 4-pt Even4 0.2 Odd4 1.0 AddsSub4 0.8 8-pt Odd8 5.7 AddSub8 1.8 16-pt Odd16 16.9 AddSub16 3.2 32-pt Odd32 54.0 AddSub32 6.1 Mux, Demux, Rounding 10.3 Total 100

Table 3 summarizes the hardware sharing between forward and inverse transforms that enables an area reduction of over 40%.

TABLE 3 Shared Not-shared  4-pt Even4 matrix multiplication AddSub4 logic Odd4 matrix multiplication  8-pt Even4 matrix multiplication AddSub8 logic Odd4 matrix multiplication Odd8 matrix multiplication 16-pt Even4 matrix multiplication AddSub16 logic Odd4 matrix multiplication Odd8 matrix multiplication Odd16 matrix multiplication 32-pt Even4 matrix multiplication AddSub32 logic Odd4 matrix multiplication Odd8 matrix multiplication Odd16 matrix multiplication Odd32 matrix multiplication

Other Embodiments

While the invention has been described with respect to a limited number of embodiments, those skilled in the art, having benefit of this disclosure, will appreciate that other embodiments can be devised which do not depart from the scope of the invention as disclosed herein.

For example, embodiments have been described for the HEVC core transform. One of ordinary skill in the art will understand embodiments for transforms that have similar symmetry properties to the HEVC core transform. Further, one of ordinary skill in the art will understand embodiments for transforms larger than a 32-pt transform.

In some embodiments, the values of the transforms coefficients may be hardwired for each of the matrix multiplication blocks. In some embodiments, the values of the transform coefficients may be programmable for each of the matrix multiplication blocks.

In some embodiments, the 4/×4 forward and inverse transform computation may be implemented separately. In such embodiments, the unified forward and inverse 8-pt transform architecture (see FIG. 13) would not compute the even matrix multiplication via the unified 4-pt transform architecture. Instead, the unified 4-pt block of FIG. 13 would be replaced with an Even4 multiplication circuit that implements matrix multiplication with the even matrix of 8-pt forward transform.

Embodiments of the methods, encoders, and decoders described herein may be implemented in hardware, software, firmware, or any combination thereof. If completely or partially implemented in software, the software may be executed in one or more processors, such as a microprocessor, application specific integrated circuit (ASIC), field programmable gate array (FPGA), or digital signal processor (DSP). The software instructions may be initially stored in a computer-readable medium and loaded and executed in the processor. In some cases, the software instructions may also be sold in a computer program product, which includes the computer-readable medium and packaging materials for the computer-readable medium. In some cases, the software instructions may be distributed via removable computer readable media, via a transmission path from computer readable media on another digital system, etc. Examples of computer-readable media include non-writable storage media such as read-only memory devices, writable storage media such as disks, flash memory, memory, or a combination thereof.

Although method steps may be presented and described herein in a sequential fashion, one or more of the steps shown in the figures and described herein may be performed concurrently, may be combined, and/or may be performed in a different order than the order shown in the figures and/or described herein. Accordingly, embodiments should not be considered limited to the specific ordering of steps shown in the figures and/or described herein.

It is therefore contemplated that the appended claims will cover any such modifications of the embodiments as fall within the true scope of the invention. 

What is claimed is:
 1. An apparatus for computation of forward and inverse transforms, the apparatus comprising: a first decomposition circuit configured to receive an N-point input vector, wherein the first decomposition circuit is operable to decompose the N-point input vector to form a first (N/2)-point vector and a second (N/2)-point vector, wherein, in response to a control signal, the first (N/2)-point vector and the second (N/2)-point vector are inputs for an N-point forward transform computation or inputs for an N-point inverse transform computation; a first matrix multiplication circuit coupled to the first decomposition circuit to receive the second (N/2)-point vector; a forward and inverse (N/2)-point transform computation circuit coupled to the first decomposition circuit to receive the first (N/2)-point vector; a first recomposition circuit coupled to receive a first (N/2)-point output vector from the first matrix multiplication circuit and a second (N/2)-point output vector from the forward and inverse (N/2)-point transform computation circuit, wherein the first recomposition circuit is operable to compose an N-point output vector from the first (N/2)-point output vector and the second (N/2)-point output vector, wherein, in response to the control signal, the N-point output vector is an output of the N-point forward transform computation or an output of the N-point inverse transform computation, wherein the first matrix multiplication circuit is configured to multiply an (N/2)-point vector with an (N/2)×(N/2) matrix, the (N/2)×(N/2) matrix consisting of elements from odd lines of an N×N transform coefficient matrix, and wherein the forward and inverse (N/2)-point transform computation circuit is configured to compute an (N/2)-point forward transform or an (N/2)-point inverse transform responsive to the control signal.
 2. The apparatus of claim 1, wherein the forward and inverse (N/2)-point transform computation circuit comprises: a second decomposition circuit configured to receive an (N/2)-point input vector, wherein the second decomposition circuit is operable to decompose the (N/2)-point input vector to form a first (N/2)/2-point vector and a second (N/2)/2-point vector, wherein, in response to the control signal, the first (N/2)/2-point vector and the second (N/2)/2-point vector are inputs for an (N/2)-point forward transform computation or inputs for an (N/2)-point inverse transform computation; a second matrix multiplication circuit coupled to the second decomposition circuit to receive the second (N/2)/2-point vector; a forward and inverse (N/2)/2-point transform computation circuit coupled to the second decomposition circuit to receive the first (N/2)/2-point vector; a second recomposition circuit coupled to receive a first (N/2)/2-point output vector from the second matrix multiplication circuit and a second (N/2). 2-point output vector from the forward and inverse (N/2)/2-point transform computation circuit, wherein the second recomposition circuit is operable to compose an (N/2)-point output vector from the first (N/2)/2-point output vector and the second (N/2)/2-point output vector, wherein, in response to the control signal, the (N/2)-point output vector is an output of the (N/2)-point forward transform computation or an output of the (N/2)-point inverse transform computation, wherein the second matrix multiplication circuit is configured to multiply an (N/2)/2-point vector with an (N/2)/2×(N/2)/2 matrix, the (N/2)/2×(N/2)/2 matrix consisting of elements from even lines of the N×N transform coefficient matrix, and wherein the forward and inverse (N/2)/2-point transform computation circuit is configured to compute an (N/2)/2-point forward transform or an (N/2)/2-point inverse transform responsive to the control signal.
 3. The apparatus of claim 2, wherein N=32.
 4. The apparatus of claim 1, wherein the first decomposition circuit comprises: an addition and subtraction circuit configured to add and subtract elements of the input N-point vector according to even odd decomposition to generate an N-point multiplicand vector; means for decomposing the N-point multiplicand vector into a first N/2-point multiplicand vector and a second N/2-point multiplicand vector; means for decomposing the N-point vector into an odd N/2 vector and an even N/2 vector, wherein the even N/2-point vector consists of elements from even locations of the N-point input vector and the odd N/2-point vector consists of elements from odd locations of the N-point input vector; and means for selecting the first N/2-point multiplicand vector and the second N/2-point multiplicand vector or the even N/2 vector and the odd N/2 vector as the first N/2 vector and the second N/2 vector in response to the control signal.
 5. The apparatus of claim 1, wherein the first recomposition circuit comprises: an addition and subtraction circuit configured to add and subtract elements of the first (N/2)-point output vector and the second (N/2)-point output vector according to even odd decomposition to generate the N-point output vector; means for composing the first (N/2)-point output vector and the second (N/2)-point output vector to generate the N-point output vector; and means for routing the first (N/2)-point output vector and the second (N/2)-point output vector to the addition and subtraction circuit or the means for composing in response to the control signal.
 6. A method for computation of forward and inverse N-point transforms, the method comprising: receiving a control signal, wherein the control signal indicates where a forward transform or an inverse transform is to be computed; receiving an N-point input vector in a first decomposition circuit, wherein the first decomposition circuit decomposes the N-point input vector to form a first (N/2)-point vector and a second (N/2)-point vector, wherein, in response to the control signal, the first (N/2)-point vector and the second (N/2)-point vector are inputs for an N-point forward transform computation or inputs for an N-point inverse transform computation; performing matrix multiplication of the second (N/2)-point vector with an (N/2)×(N/2) matrix in a first matrix multiplication circuit, the first matrix multiplication circuit coupled to the first decomposition circuit to receive the second (N/2)-point vector, wherein the (N/2)×(N/2) matrix consists of elements from odd lines of an N×N transform coefficient matrix; computing an (N/2)-point transform of the first (N/2)-point vector in a forward and inverse (N/2)-point transform computation circuit coupled to the first decomposition circuit to receive the first (N/2)-point vector, wherein the forward and inverse (N/2)-point transform computation circuit computes an (N/2)-point forward transform or an (N/2)-point inverse transform responsive to the control signal; and composing an N-point output vector in a first recomposition circuit, the first recomposition circuit coupled to receive a first (N/2)-point output vector from the first matrix multiplication circuit and a second (N/2)-point output vector from the forward and inverse (N/2)-point transform computation circuit, wherein the first recomposition circuit composes the N-point output vector from the first (N/2)-point output vector and the second (N/2)-point output vector, wherein, in response to the control signal, the N-point output vector is an output of the N-point forward transform computation or an output of the N-point inverse transform computation.
 7. The method of claim 6, further comprising: receiving the first (N/2)-point input vector in a second decomposition circuit comprised in the forward and inverse (N/2)-point transform computation circuit, wherein the second decomposition circuit decomposes the first (N/2)-point input vector to form a first (N/2)/2-point vector and a second (N/2)/2-point vector, wherein, in response to the control signal, the first (N/2)/2-point vector and the second (N/2)/2-point vector are inputs for an (N/2)-point forward transform computation or inputs for an (N/2)-point inverse transform computation; performing matrix multiplication of the second (N/2)/2-point vector with an (N/2)/2×(N/2)/2 matrix in a second matrix multiplication circuit comprised in the forward and inverse (N/2)-point transform computation circuit, the second matrix multiplication circuit coupled to the first decomposition circuit to receive the second (N/2)/2-point vector, wherein the (N/2)/2×(N/2)/2 matrix consists of elements from odd lines of the N×N transform coefficient matrix; computing an (N/2)/2-point transform of the first (N/2)/2-point vector in a forward and inverse (N/2)/2-point transform computation circuit coupled to the second decomposition circuit to receive the first (N/2)/2-point vector, wherein the forward and inverse (N/2)/2-point transform computation circuit computes an (N/2)/2-point forward transform or an (N/2)/2-point inverse transform responsive to the control signal; and composing an (N/2)-point output vector in a second recomposition circuit comprised in the forward and inverse (N/2)-point transform computation circuit, the second recomposition circuit coupled to receive a first (N/2)/2-point output vector from the second matrix multiplication circuit and a second (N/2)/2-point output vector from the forward and inverse (N/2)/2-point transform computation circuit, wherein the second recomposition circuit composes the (N/2)-point output vector from the first (N/2)/2-point output vector and the second (N/2)/2-point output vector, wherein, in response to the control signal, the (N/2)-point output vector is an output of the (N/2)-point forward transform computation or an output of the (N/2)-point inverse transform computation.
 8. The method of claim 6, wherein N=32.
 9. The method of claim 6, wherein the first decomposition circuit decomposes the first (N/2)-point input vector by: adding and subtracting elements of the input N-point vector in an addition and subtraction circuit configured to add and subtract elements of the input N-point vector according to even odd decomposition to generate an N-point multiplicand vector; decomposing the N-point multiplicand vector into a first N/2-point multiplicand vector and a second N/2-point multiplicand vector; decomposing the N-point vector into an odd N/2 vector and an even N/2 vector, wherein the even N/2-point vector consists of elements from even locations of the N-point input vector and the odd N/2-point vector consists of elements from odd locations of the N-point input vector; and selecting the first N/2-point multiplicand vector and the second N/2-point multiplicand vector or the even N/2 vector and the odd N/2 vector as the first N/2 vector and the second N/2 vector in response to the control signal.
 10. The method of claim 6, wherein the first recomposition circuit composes the (N/2)-point output vector by routing the first (N/2)-point output vector and the second (N/2)-point output vector to an addition and subtraction circuit or a means for composing in response to the control signal, wherein the addition and subtraction circuit is configured to add and subtract elements of the first (N/2)-point output vector and the second (N/2)-point output vector according to even odd decomposition to generate the N-point output vector, and the means for composing is configured to compose the first (N/2)-point output vector and the second (N/2)-point output vector to generate the N-point output vector. 